Chapter 2 ARM + + : A HYBRID ASSOCIATION RULE MINING ALGORITHM
نویسندگان
چکیده
Most of the approaches for association rule mining focus on the performance of the discovery of the frequent itemsets. They are based on the algorithms that require the transformation of data from one representation to another, and therefore excessively use resources and incur heavy CPU overhead. This chapter proposes a hybrid algorithm that is resource efficient and provides better performance. It characterizes the trade-offs among data representation, computation, I/O, and heuristics. The proposed algorithm uses an array-based item storage for the candidate and frequent itemsets. In addition, we propose a comparison algorithm (CmpApr) that compares candidate itemsets with a transaction, a filtering algorithm (FilterApr) that reduces the number of comparison operations required to find frequent itemsets. The hybrid algorithm (ARM++) integrates filtering methods within the Partition algorithm [7]. Performance analyses from our implementation indicate that ARM++ has better performance and scales linearly.
منابع مشابه
Introducing New Hybrid Rough Fuzzy Association Rule Mining Algorithm
Association rules shows us interesting associations among data items. It means that an association rule clearly defines that how a data item is related or associated with another data item. That is why these types of rules are called Association rules. And the procedure by which these rules are extracted and managed is known as Association rule mining. Classical association rule mining had many...
متن کاملArm++: A Hybrid Association Rule Mining Algorithm
Most of the approaches for association rule mining focus on the performance of the discovery of the frequent itemsets. They are based on the algorithms that require to transform data from one representation to another, and therefore excessively use resource and incur heavy CPU overhead. This paper proposes a hybrid algorithm that is a resource-efficient and provides better performance. It chara...
متن کاملA Hybrid Algorithm for Association Rule Hiding using Representative Rule
In the recent years, data mining has emerged as a very popular tool for extracting hidden knowledge from collection of large amount of data. One of the major challenges of data mining is to find the hidden knowledge in the data while the sensitive information is not revealed. Many strategies have been proposed to hide the information containing sensitive data. Privacy preserving data mining is ...
متن کاملNumeric Multi-Objective Rule Mining Using Simulated Annealing Algorithm
Abstract as a single objective one. Measures like support, confidence and other interestingness criteria which are used for evaluating a rule, can be thought of as different objectives of association rule mining problem. Support count is the number of records, which satisfies all the conditions that exist in the rule. This objective represents the accuracy of the rules extracted from the da...
متن کاملWeb Page Prediction using Hybrid Model
One of the most important internet challenges in coming years will be the introduction of intelligent services and a more personalized environment for user. In this paper web page prediction is presented. We use several classification techniques, namely, Support Vector Machines (SVM), Association Rule mining (ARM), and Markov model in WWW prediction. We proposed a hybrid model by combining two ...
متن کامل